Location:
Search - tsp cost
Search list
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: |
Size: 4853791 |
Author: 陈宝文 |
Hits:
Description: 遗传算法和“货郎担” 问题:
\"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point.\"
Platform: |
Size: 284142 |
Author: s050403054 |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。
bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
Platform: |
Size: 11662 |
Author: 岳明 |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: |
Size: 4853760 |
Author: 陈宝文 |
Hits:
Description: 可行点标记求最佳匹配算法的MATLAB 程序代码 求最小费用最大流算法的MATLAB 程序代码 匈牙利算法的MATLAB 程序代码 遗传算法解决TSP问题的Matlab程序 遗传算法解决非线性规划问题的Matlab程序 -Feasible point marking the best matching algorithm for the MATLAB code for the minimum cost maximum flow algorithm of the MATLAB program code Hungarian algorithm MATLAB code genetic algorithm to solve TSP problems Matlab procedures for genetic algorithm to solve nonlinear programming problems Matlab procedures
Platform: |
Size: 119808 |
Author: |
Hits:
Description: 遗传算法和“货郎担” 问题:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point." -Genetic algorithm and the
Platform: |
Size: 283648 |
Author: s050403054 |
Hits:
Description: 用动态规划算法求解旅行商销售员问题，给出一个耗费矩阵，能够得出最短路径长度和最短路径。-Using dynamic programming algorithm to solve traveling salesman salesman problem, given a cost matrix, able to draw the shortest path length and the shortest path.
Platform: |
Size: 2043904 |
Author: wu |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。
bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Platform: |
Size: 11264 |
Author: 岳明 |
Hits:
Description: Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a constant subtracted from any row
or any column of the cost matrix, an
optimal solution does not change.
Platform: |
Size: 135168 |
Author: 黃文岩 |
Hits:
Description: 蚁群算法实现TSP问题，30城市，不考虑代价问题-Ant colony algorithm for TSP, 30 cities, regardless of cost in the
Platform: |
Size: 3990528 |
Author: 李涛 |
Hits:
Description: TSP分支限界法求最短路径，可读取代价矩阵的txt。-Use TSP branch and bound Method to find the shortest path. Cost matrix can be read from txt.
Platform: |
Size: 194560 |
Author: sd |
Hits:
Description: TSP(旅行商问题):cost存放了一个强连通图的边权矩阵，作为一个实例。可在workspace中加载运用此算法要注意多次试验。-TSP (Traveling Salesman Problem): cost storage of a strongly connected graph edge weight matrix, as an example. The use of this algorithm can be loaded in the workspace to pay attention to several tests.
Platform: |
Size: 8192 |
Author: 王海 |
Hits:
Description: 该文包括了基于 Matlab 的遗传算法解决 TSP 问题的
基本说明 ， 并在文后附录了实现该算法的所有源代码 。 此代
码经过本人的运行 ， 没有发现错误 ， 结果比较接近理论最优
值，虽然最优路径图有点交叉。
因为本人才疏学浅 ， 本报告及源代码的编译耗费了本人
较多的时间与精力 ， 特收取下载 积分 ， 还请见谅 。 若有什么
问题，可以私信，我们共同探讨这一问题。
希望能对需要这方面的知识的人有所帮助！-Description: Description: Description: Description: This paper includes the basic description of the Matlab-based genetic algorithm to solve TSP problem, and all the source code for the algorithm in the appendix below. This code after my run, no errors are found, the results are close to the theoretical optimal value, although the optimal path diagram a little cross. I Caishuxueqian this report and the source code, compile cost himself more time and effort, special charge Download Credits, please forgive me. If there be any problem, private letter, we explore this issue. Hope to help the people who need this knowledge!
Platform: |
Size: 4096 |
Author: 小小 |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。-storage cost of a strongly connected graph edge weight matrix, as an example. Loaded in the workspace using this algorithm is to pay attention to several tests.
Platform: |
Size: 8192 |
Author: 肖杰飞 |
Hits:
Description: 基于降度算法的哈密尔顿最优圈搜寻方法,寻找费用最小的哈密尔顿路径，用于解决TSP、任务分流、任务指派等问题-Find the best Hamilton route based on the method of lap down algorithm. The algorithm finds the minimum cost path for solving TSP, the task diversion, task assignment and other issues
Platform: |
Size: 115712 |
Author: 钟腾 |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。-solve the TSP problem
Platform: |
Size: 10240 |
Author: lyuzifeng |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。-cost edge weight matrix stored for a strongly connected graph, as an example. Using this algorithm can be loaded in the workspace should pay attention to several tests.
Platform: |
Size: 9216 |
Author: Billustrator |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。(Cost holds the edge weight matrix of a strongly connected graph as an instance. You can load in workspace, use this algorithm to pay attention to many tests.)
Platform: |
Size: 8192 |
Author: katy@
|
Hits:
Description: 旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman Problem, TSP) is a special case of the vehicle routing scheduling Problem (VRP), due to the mathematician has proved the TSP Problem is NP Problem, therefore, the VRP also belongs to the NP problems.Traveling salesman problem (TSP) is translated into traveling salesman problem, traveling salesman problem, referred to as the TSP problem, is the most basic route problem, the problem is looking for single travelers from the starting point, through all of the requirements of a given point, after the final path back to the origin of the minimum cost)
Platform: |
Size: 1024 |
Author: 枫雪@SPW
|
Hits:
Description: 蚁群算法，蚁群优化算法（ant colony optimization,ACO）就是一种特别成功的元启发式算法，在20年前诞生于意大利的一所最负盛名的大学——米兰理工大学。其灵感来源于真实蚂蚁的行为。(We list below 25 TSP instances taken from the World TSP. For these instances, the cost of travel between cities is specified by the Eulidean distance rounded to the nearest whole number .)
Platform: |
Size: 76800 |
Author: 7号咯
|
Hits: